Achieving k-anonymity using Minimum Spanning Tree based Partitioning

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achieving k-anonymity using Minimum Spanning Tree based Partitioning

Protecting individual‟s privacy has become a major concern among privacy research community. Many frameworks and privacy principles were proposed for protecting the privacy of the data that is being released to the public for mining purpose. k-anonymization was the most popular among the proposed techniques in which the sensitive association between the sensitive attributes and their correspond...

متن کامل

Fast Approximate Minimum Spanning Tree Algorithm Based on K-Means

It is difficult to apply traditional Minimum spanning tree(MST) algorithms to a large dataset since the time complexity of the algorithms is quadratic. In this paper, we present a fast approximate MST framework on the complete graph of N points, and any exact MST algorithm can be incorporated into the framework and speeded up. The proposed framework employs a divide-and-conquer scheme to produc...

متن کامل

A fast minimum spanning tree algorithm based on K-means

Article history: Received 14 June 2014 Received in revised form 25 September 2014 Accepted 3 October 2014 Available online 14 October 2014

متن کامل

Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm

This paper discusses a novel approach to associate and re ne aircraft track data from multiple radar sites. The approach provides enhanced aircraft track accuracy and time synchronization that is compatible with modern air tra c management analysis and simulation tools. Unlike existing approaches where the number of aircraft in the radar data must be assumed, this approach requires no such prio...

متن کامل

Minimum spanning tree based one-class classifier

In the problem of one-class classification one of the classes, called the target class, has to be distinguished from all other possible objects. These are considered as non-targets. The need for solving such a task arises in many practical applications, e.g. in machine fault detection, face recognition, authorship verification, fraud recognition or person identification based on biometric data....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2013

ISSN: 0975-8887

DOI: 10.5120/13253-0729